Nash-solvable two-person symmetric cycle game forms
نویسندگان
چکیده
منابع مشابه
Nash-solvable bidirected cyclic two-person game forms
We consider cyclic positional games of two players. Let − → G = (V, − → E ) be a directed graph (digraph) and P : V = V1 ∪V2 ∪VT be a partition of its vertices (positions) in three subsets: V1 and V2 are positions of players 1 and 2, respectively, and VT are the terminal positions. Directed edges going from a position j ∈ V1 (respectively, j ∈ V2) are called the moves of player 1 (respectively,...
متن کاملTotal tightness implies Nash-solvability for three-person game forms
It is long known [13] that every totally tight 2-person game form is Nash-solvable, that is, it has a Nash-equilibrium for any set of player preferences. Furthermore, it is also known [2] that every totally tight 2-person game form is acyclic and dominance solvable. In this short paper we generalize the first result to 3-person game forms, leaving the general n-person case open. On the other ha...
متن کاملTwo-Person Symmetric Whist
The game of two-person whist is played with a deck of cards. Each card belongs to a suit, and each suit is totally ordered. The cards are distributed between the two players so that each player receives the same number of cards. Hence both players have complete information about the deal. Play proceeds in tricks, with the obligation to follow suit, as in many real-world card games. We study the...
متن کاملTwo-person Knapsack Game
In this paper, we study a two-person knapsack game. Two investors, each with an individual budget, bid on a common pool of potential projects. To undertake a project, investors have their own cost estimation to be charged against their budgets. Associated with each project, there is a potential market profit that can be taken by the only bidder or shared proportionally by both bidders. The obje...
متن کاملA three-person deterministic graphical game without Nash equilibria
We give an example of a three person chess-like game that has no Nash equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a unique cycle and three terminal positions), and its normal form is of size 2×2×4 only. Thus, our example strengthens significantly the one obtained in 2014 by Gurvich and Oudalov, which has four players, five terminals, and 2×4×6×8 norma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.05.011